Skip to content

Small Corrections for Tree Traversal in Python #337

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom
Merged
merged 1 commit into from
Aug 5, 2018
Merged

Small Corrections for Tree Traversal in Python #337

merged 1 commit into from
Aug 5, 2018

Conversation

Wesley-Arrington
Copy link
Contributor

  • Corrected recursion in DFS_recursive_postorder
  • Fixed DFS_recursive_inorder_btree
  • Called DFS_recursive_postorder and DFS_recursive_inorder_btree in main()

@Wesley-Arrington
Tree Traversal in Python Corrections
323d85f 
- Corrected recursion in DFS_recursive_postorder
- Fixed DFS_recursive_inorder_btree
- Called DFS_recursive_postorder and DFS_recursive_inorder_btree in main()
leios
leios approved these changes Aug 5, 2018
View reviewed changes
Copy link
Member

@leios leios left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Yeah, this fixes a clear bug in the code and cleans it up nicely. Thanks!

@leios leios merged commit 15e5a54 into algorithm-archivists:master Aug 5, 2018
@Wesley-Arrington Wesley-Arrington deleted the fixingPythonTree branch August 5, 2018 07:21
@Gathros Gathros mentioned this pull request Aug 5, 2018
Closed
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers

@leios leios leios approved these changes

Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
2 participants
@Wesley-Arrington @leios